| 翻訳と辞書 |
| Edmonds–Karp algorithm ： ウィキペディア英語版 |
Edmonds–Karp algorithm
In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in ''O''(''V'' ''E''2) time. The algorithm was first published by Yefim (Chaim) Dinic in 1970 and independently published by Jack Edmonds and Richard Karp in 1972. Dinic's algorithm includes additional techniques that reduce the running time to ''O''(''V''2''E'').
==Algorithm==
The algorithm is identical to the Ford–Fulkerson algorithm, except that the search order when finding the augmenting path is defined. The path found must be a shortest path that has available capacity. This can be found by a breadth-first search, as we let edges have unit length. The running time of ''O''(''V'' ''E''2) is found by showing that each augmenting path can be found in ''O''(''E'') time, that every time at least one of the ''E'' edges becomes saturated (an edge which has the maximum possible flow), that the distance from the saturated edge to the source along the augmenting path must be longer than last time it was saturated, and that the length is at most ''V''. Another property of this algorithm is that the length of the shortest augmenting path increases monotonically. There is an accessible proof in ''Introduction to Algorithms''.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Edmonds–Karp algorithm」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|